Visualization of ontology evolution using ontodi graph

Ontologies evolve with the passing of time due to improvements, corrections or changes in requirements that need to be made. In this paper we describe a thesis work aiming at the creation of a visualization technique with the objective of allowing the viewer to easily identify changes made in an ontology. With the use of a specification based on the already existing Visual Notation for OWL Ontologies (VOWL) it is possible to display the differences that exist between two versions of an ontology. The proposed approach will be implemented in an application, that is also discussed in the paper.This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT – Fundação para a Ciência e Tecnologia within the Project Scope: UID/CEC/ 00319/2013

Socii: A Tool to Analyze and Visualize Dynamic Social Networks

Social media network analysis represents a major challenge for data scientists in every aspect, since the extraction all the way to the visualization. Despite representing a major technological challenge, social media data analysis has an additional motivation, that is the daily usage in every country across the planet, making Online Social Network (OSN) a universal tool for communication, such as radio or TV, but with the technological flavor of the 21st century. In the present article, we propose a system, called Socii, for social networks analysis and visualization, as part of an ongoing work under a master’s dissertation. This system overlaps two main scientific fields, sociology (more concisely social networks) and computer science. Socii aims at helping OSNs users to know and understand social structures through a user friendly interface. The system relies in four main principles, namely simplicity, accessibility, OSNs integration and contextual analysis.FCT -Fundação para a Ciência e a Tecnologia(UID/CEC/ 00319/2013

Program analysis and evaluation using QUIMERA

During last years, a new challenge rose up inside the programming communities: the programming contests. Programming contests can vary slightly in the rules but all of them are intended to assess the competitor skills concerning the ability to solve problems using a computer. These contests raise up three kind of challenges: to create a nice problem statement (for the members of the scientific committee); to solve the problem in a good way (for the programmers); to find a fair way to assess the results (for the judges). This paper presents a web-based application, QUIMERA intended to be a full programming-contest management system, as well as an automatic judge. Besides the traditional dynamic approach for program evaluation, QUIMERA still provides static analysis of the program for a more fine assessment of solutions. Static analysis takes profit from the technology developed for compilers and language-based tools and is supported by source code analysis and software metrics.(undefined

Partial correctness and continuous integration in computer supported education

In this paper we support the idea that students and teachers will benefit from a computer-based system that assesses programming exercises and provide immediate and detailed feedback: students would be able to evolve in the right direction and teachers would follow and assess more fairly their students. This assessment should outperform the typical right/wrong evaluation returned by existing tools, allowing for a flexible partial evaluation. Moreover, we adopt a concept from Agile Development, the Continuous Integration (CI), to improve students’ effectiveness. The applicability of CI reflects a better monitoring by the teams and their individual members, also providing the ability to improve the speed of the development. Besides the description of the capabilities that we require from an Automatic Grading System (AGS), we discuss iQuimera, an improved AGS that we are working on, that implements our teaching/learning principles.Fundação para a Ciência e a Tecnologia (FCT

Freshness Control of XML Documents for Query Load Balancing

International audienceWe present an approach for controlling the freshness of replicated XML documents. The main idea is that read-only transactions may accept to read stale data, provided they can express an upper bound on the staleness of the data they read. Controlling the freshness of data accessed by read-only transactions greatly improves load balancing since it allows for choosing a node for executing the transaction even if it is not perfectly fresh. Such a routing is based on detecting which parts of a document are likely to be updated by a given transaction. Due to the rich nature of XML, the problem is quite more complex than for relational SQL data. We present a new algorithm for conflict detection between transactions, needed to estimate freshness of data according to the missing transactions on a node. We also present new freshness measures, in order to take into account the structure/content nature of XML

A processing environment for the IXDIRQL XML query language

XPath is a language for accessing XML components using structural and content restrictions. The IXDIRQL language extends XPath with selection operations that allow for the selection of the interesting subset of elements from each intermediate result of a query. To make this possible, intermediate results must be available during the construction of the query. This helps the user in building a query to retrieve the desired result. Moreover, in IXDIRQL textual similarity search used in Information Retrieval is also possible, leading to a ranked list of elements. A prototype for IXDIRQL processing has been used by real users to check its correct behaviour and the correct specification of queries using selection operations. In this paper we present some interesting aspects of the construction and the use of the IXDIRQL processing prototype

Construçao e utilizaçao de um prototipo para o processamento da linguagem de interrogaçao IXDIRQL

International audienc

Presenting the Results of Relevance-Oriented Search over XML Documents

International audienceIn this paper we discuss how to present the result of searching elements of any type from XML documents relevant to some information need (relevance-oriented search). As the resulting elements can contain each other we show an intuitive way of organizing the resulting list of elements in several ranked lists at different levels such that each element is presented only one time. Depending on the size of such ranked lists its presentation is given by a structure tree for small lists or by a sequence of pointers for large lists. In both cases the textual content of the implied elements is given. We also analyse the size of ranked lists in a real collection of XML documents

Using semantics in XML information access : application to the Portuguese Emigration Museum

This article presents an ongoing work, in the context of the Portuguese Emigration Museum, about information access in XML collections associated with semantic information. The museum asset is made up of documents of more than 8 kinds, ranging from passport records to photos/cards or building-drawings. In this paper we discuss the approach used to create the exhibition rooms of the virtual Web-based museum. Each room consists of a view over the information contained in those single or interrelated resources. The information exhibited in each room is described by an ontology, written in OWL. We also discuss the approach used to take advantage of a combination of structural and semantic information to efficiently retrieve documents from the MEC collection. Both approaches can be automatised to allow a very systematic way to deal with the huge and rich museum assets